Realizability Interpretation of Generalized Inductive Definitions
نویسندگان
چکیده
Kobayashi, S. and M. Tatsuta, Realizability interpretation of generalized inductive definitions, Theoretical Computer Science 131 (1994) 121-138. Generalized inductive definitions give a way of defining a predicate as the least solution P of the equation P-A [P] where a predicate variable P may occur in a formula A[P] positively. This paper gives a q-realizability interpretation of generalized inductive definitions and proves the soundness of the interpretation.
منابع مشابه
A Curry-Style Realizability Interpretation for Monotone Inductive Definitions
The logical system AF2μ, an extension of second-order predicate calculus with monotone inductive definitions, is presented. Some properties of this system are shown including that it is a good system for extracting programs from proofs by means of a realizability interpretation in the style of Krivine-Parigot, where the realizers are terms of the Curry-system of λ-calculus and the realizability...
متن کاملModified Realizability and Inductive Types
In 1959, Kreisel introduced a notion of “modified” realizability that, among other things, provides an alternative technique to Gödel functional (dialectica) interpretation for establishing the connection between Peano Arithmetic and System T. While the dialectica interpretation has been widely studied in the literature, Kreisel’s technique, although remarkably simpler, has apparently been almo...
متن کاملA realizability interpretation of Church's simple theory of types
We give a realizability interpretation of an intuitionistic version of Church’s Simple Theory of Types (CST) which can be viewed as a formalization of intuitionistic higher-order logic. Although definable in CST we include operators for monotone induction and coinduction and provide simple realizers for them. Realizers are formally represented in an untyped lambda-calculus with pairing and case...
متن کاملGeneralizing Inference Systems by Coaxioms
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference system allows coaxioms, which are, intuitively, axioms which can only be applied “at infinite depth” in a proof tree. This notion nicely subsumes standard infere...
متن کاملAbstract Interpretation of Non-monotone Bi-inductive Semantic Definitions
Interpretation of Non-monotone Bi-inductive Semantic Definitions ,
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 131 شماره
صفحات -
تاریخ انتشار 1994